System Description: Celf – A Logical Framework for Deductive and Concurrent Systems

نویسندگان

  • Anders Schack-Nielsen
  • Carsten Schürmann
چکیده

CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security protocol analysis, process algebras, and logics. Celf is an implementation of the CLF type theory that extends the LF type theory by linear types to support representation of state and a monad to support representation of concurrency. It relies on the judgments-as-types methodology for specification and the interpretation of CLF signatures as concurrent logic programs [LPPW05] for experimentation. Celf is written in Standard ML and compiles with MLton and MLKit. The source code and a collection of examples are available from http://www.twelf.org/∼celf.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanizing metatheory in a logical framework

The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this methodology, the syntactic and deductive apparatus of a system is encoded as the canonical forms of associated LF types; an encoding is correct (adequate) if and only if it defines a compositional bijection between the appar...

متن کامل

Executable denotations for concurrent languages using Concurrent Transaction Logic

This paper presents an approach based on a Horn fragment of Concurrent Transaction Logic ( CT R) for semantic description and execution of programming languages. The Horn notation is used in much the same way that plain Horn logic is used to specify semantics of programming languages. However, CT R extends that framework a deductive database language which provides a declarative, logic programm...

متن کامل

Logical Speci cation of Bulk Updates and Sequential

Most current deductive database systems ooer only limited support for updates. We present a logical framework that allows to combine procedural update methods with set-oriented updates. The conventional database update operations are subsumed by our approach.

متن کامل

Transaction Datalog: A Compositional Language for Transaction Programming

In the classical model of database transactions, large transactions cannot be built out of smaller ones. Instead, transactions are modelled as atomic and isolated units of work. This model has been widely successful in traditional database applications, in which transactions perform only a few simple operations on small amounts of simply-structured data. Unfortunately, this model is inappropria...

متن کامل

System Description: Russell - A Logical Framework for Deductive Systems

Russell is a logical framework for the specification and implementation of deductive systems. It is a high-level language with respect to Metamath language [7], so inherently it uses a Metamath foundations, i.e. it doesn’t rely on any particular formal calculus, but rather is a pure logical framework. The main difference with Metamath is in the proof language and approach to syntax: the proofs ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008